Parallelization of Biological Gene Sequencing Technique with Optimized Smith Waterman Algorithm
نویسندگان
چکیده
The presented research work represent a highly robust and efficient parallel computing system development for biological gene sequencing. In this research work, the existing approaches has optimized the most optimum approach available till date in the form of Smithy Waterman algorithm for gene alignment or local gene sequencing. This paper mainly emphasizes on the system development for a traceback assisted optimum diagonal sequencing approach developed with optimized smith Waterman and Myers and Millers techniques. Considering optimization approaches it can be firmly stated that the presented work not only enhances the competing efficiency but also facilitates higher optimum memory occupancy for huge data sets and pattern possibilities.
منابع مشابه
Automatic Parallelization for Parallel Architectures Using Smith Waterman Algorithm
Gene sequencing problems are one of the predominant issues for researchers to come up with an optimized system model that could facilitate the optimum processing and efficiency without introducing overheads in terms of memory and time. This research is oriented towards developing such kind of system while taking into consideration of the dynamic programming approach called a Smith Waterman algo...
متن کاملStaircase Method: A Novel Method for Parallelizing S-W Algorithm
Sequence comparison is a basic operation in DNA sequencing projects, and most of sequence comparison methods are based on heuristics, which are fast but not sensitive. The Dynamic Programming Algorithm, Smith-Waterman, obtains the best alignment, but at the expense of computational time. Unfortunately, the inefficiency in the performance of the Smith-Waterman algorithm limits its applications i...
متن کاملParallel Smith-Waterman Algorithm for Gene Sequencing
Smith-Waterman Algorithm represents a highly robust and efficient parallel computing system development for biological gene sequence. The research work here gives a deep understanding and knowledge transfer about exiting approach for gene sequencing and alignment using Smith-waterman their strength and weaknesses. Smith-Waterman algorithm calculates the local alignment of two given sequences us...
متن کاملAn Efficient Bulk Synchronous Parallelized Scheduler for Bioinformatics Application on Public Cloud
Genomic sequence alignment of varied species is one of the most sort of applications in bioinformatics. In future bioinformatics technologies are expected to produce genomic data of terabyte. Bioinformatics computation require super computer for sequence alignment computation which involves huge cost. Parallelization technique is a way forward in computing sequence alignment with limited cost a...
متن کاملAccelerating Smith-Waterman Alignment for Protein Database Search Using Frequency Distance Filtration Scheme Based on CPU-GPU Collaborative System
The Smith-Waterman (SW) algorithm has been widely utilized for searching biological sequence databases in bioinformatics. Recently, several works have adopted the graphic card with Graphic Processing Units (GPUs) and their associated CUDA model to enhance the performance of SW computations. However, these works mainly focused on the protein database search by using the intertask parallelization...
متن کامل